Optimizing 4DCBCT projection allocation to respiratory bins

Optimizing Dynamic Resource Allocation

We present a formulation, solution method, and program acceleration techniques for two dynamic control scenarios, both with the common goal of optimizing resource allocations. These approaches allocate resources in a non-myopic way, accounting for long-term impacts of current control decisions via nominal belief-state optimization (NBO). In both scenarios, the solution techniques are paralleliz...

Balanced offline allocation of weighted balls into bins

We propose a sorting-based greedy algorithm called SortedGreedy[m] for approximately solving the offline version of the d-choice weighted balls-into-bins problem where the number of choices for each ball is equal to the number of bins. We assume the ball weights to be nonnegative. We compare the performance of the sorting-based algorithm with a näıve algorithm called Greedy[m]. We show that by ...

Balanced Allocation and Dictionaries with Tightly Packed Constant Size Bins

We study a particular aspect of the balanced allocation paradigm (also known as the “twochoices paradigm”): constant sized bins, packed as tightly as possible. Let d ≥ 1 be fixed, and assume there are m bins of capacity d each. To each of n ≤ dm balls two possible bins are assigned at random. How close can dm/n = 1+ε be to 1 so that with high probability each ball can be put into one of the two...

Optimizing anti-terrorism resource allocation

Optimizing Budget Allocation in Graphs

In a classical facility location problem we consider a graph G with fixed weights on the edges of G. The goal is then to find an optimal positioning for a set of facilities on the graph with respect to some objective function. We introduce a new framework for facility location problems, where the weights on the graph edges are not fixed, but rather should be assigned. The goal is to find the va...